Median location problem with two probabilistic line barriers: Extending the Hook and Jeeves algorithm

<p style='text-indent:20px;'>We consider a median location problem in the presence of two probabilistic line barriers on plane under rectilinear distance. It is assumed that move their corresponding horizontal routes uniformly. We first investigate different scenarios for position and routes, then define visibility invisibility conditions along with expected barrier distance functions. The proposed formulated as mixed-integer nonlinear programming model. Our aim to locate new facility so total weighted minimized. present efficient lower upper bounds using forbidden problem. To solve model, Hooke Jeeves algorithm (HJA) extended. various sample problems test performance appropriateness bounds. Also, an empirical study Kingston-upon-Thames, England, conducted illustrate behavior applicability model.</p>